The cut polytope and the Boolean quadric polytope
نویسندگان
چکیده
منابع مشابه
Some properties of the Boolean Quadric Polytope
The topic of our research is unconstrained 0-1 quadratic programming. We find some properties of the Boolean Quadric Polytope, which is obtained from the standard linearization of the given 0-1 quadratic function. By using a result obtained by Deza and Laurent on a class of hypermetric inequalities for the Cut Polytope, we find a necessary and sufficient condition for a class of inequalities to...
متن کاملMaximum-Entropy Sampling and the Boolean Quadric Polytope
We consider a bound for the maximum-entropy sampling problem (MESP) that is based on solving a max-det problem over a relaxation of the Boolean Quadric Polytope (BQP). This approach to MESP was first suggested by Christoph Helmberg over 15 years ago, but has apparently never been further elaborated or computationally investigated. We find that the use of a relaxation of BQP that imposes semidef...
متن کاملSome Characteristics of the Simple Boolean Quadric Polytope Extension
Following the seminal work of Padberg on the Boolean quadric polytope BQP and its LP relaxation BQPLP , we consider a natural extension: SATP and SATPLP polytopes, with BQPLP being projection of the SATPLP face (and BQP projection of the SATP face). We consider the problem of integer recognition: determine whether the maximum of a linear objective function is achieved at an integral vertex of a...
متن کاملOn the directed cut cone and polytope
In this paper we study the directed cut cone and polytope which are the positive hull and convex hull of all directed cut vectors of a complete directed graph, respectively. We present results on the polyhedral structure of these polyhedra. A relation between directed cut polyhedra and undirected cut polyhedra is established that provides families of facet defining inequalities for directed cut...
متن کاملOn the strength of the cycle relaxation for the boolean quadric polytope
We study unconstrained zero-one quadratic programming problems. The boolean quadric polytope arises from a standard linearization of the objective function and has been extensively studied in the literature. A well-known relaxation of the boolean quadric polytope is the cycle relaxation, which is closely related to the metric polytope for max-cut. We characterize the sign patterns of the object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90056-n